Weak Refinement for Modal Hybrid Systems
نویسندگان
چکیده
Timed modal speciications have proven useful for the veri-cation of real time systems. In the paper, we show how the notion of modal transitions systems, the basic formalism of timed modal specii-cations, can be generalized to modal hybrid systems. This allows verii-cation problems for hybrid systems to be formulated using the notion of (weak) reenement, a generalization of bisimulation. We also explain how to adopt an improved algorithm for the decision of weak reenement for timed modal speciications to modal linear hybrid systems, which offers the possibility of automatic veriication. The algorithm has already been implemented for parametrized modal timed automata, a subclass of modal linear hybrid systems.
منابع مشابه
On Modal Refinement and Consistency
Almost 20 years after the original conception, we revisit several fundamental questions about modal transition systems. First, we demonstrate the incompleteness of the standard modal refinement using a counterexample due to Hüttel. Deciding any refinement, complete with respect to the standard notions of implementation, is shown to be computationally hard (co-NP hard). Second, we consider four ...
متن کاملBisimilarity and refinement for hybrid(ised) logics
The complexity of modern software systems entails the need for reconfiguration mechanisms governing the dynamic evolution of their execution configurations in response to both external stimulus or internal performance measures. Formally, such systems may be represented by transition systems whose nodes correspond to the different configurations they may assume. Therefore, each node is endowed w...
متن کاملA logic for n-dimensional hierarchical refinement
Hierarchical transition systems provide a popular mathematical structure to represent state-based software applications in which different layers of abstraction are represented by inter-related state machines. The decomposition of high level states into inner sub-states, and of their transitions into inner sub-transitions is common refinement procedure adopted in a number of specification forma...
متن کاملOmega Algebra, Demonic Refinement Algebra and Commands
Weak omega algebra and demonic refinement algebra are two ways of describing systems with finite and infinite iteration. We show that these independently introduced kinds of algebras can actually be defined in terms of each other. By defining modal operators on the underlying weak semiring, that result directly gives a demonic refinement algebra of commands. This yields models in which extensio...
متن کاملSimilarity, Logic, and Games - Bridging Modeling Layers of Hybrid Systems
Specifications and implementations of complex physical systems tend to differ as low-level effects such as sampling are often ignored when highlevel models are created. Thus, the low-level models are often not exact refinements of the high-level specification. However, intuitively we would consider them as similar. To bridge the gap between these models, we study notions of similarity and robus...
متن کامل